Hamiltonian-Assisted Metropolis Sampling

نویسندگان

چکیده

Various Markov chain Monte Carlo (MCMC) methods are studied to improve upon random walk Metropolis sampling, for simulation from complex distributions. Examples include Metropolis-adjusted Langevin algorithms, Hamiltonian Carlo, and other algorithms related underdamped dynamics. We propose a broad class of irreversible sampling called Hamiltonian-assisted (HAMS), develop two specific with appropriate tuning preconditioning strategies. Our HAMS designed simultaneously achieve distinctive properties, while using an augmented target density momentum as auxiliary variable. One is generalized detailed balance, which induces exploration the target. The rejection-free property Gaussian prespecified variance matrix. This allows our preconditioned perform satisfactorily relatively large step sizes. Furthermore, we formulate framework Metropolis–Hastings not only highlights construction at more abstract level, but also facilitates possible further development MCMC algorithms. present several numerical experiments, where proposed consistently yield superior results among existing same schemes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metropolis Sampling

Monte Carlo (MC) sampling methods are widely applied in Bayesian inference, system simulation and optimization problems. The Markov Chain Monte Carlo (MCMC) algorithms are a well-known class of MC methods which generate a Markov chain with the desired invariant distribution. In this document, we focus on the Metropolis-Hastings (MH) sampler, which can be considered as the atom of the MCMC techn...

متن کامل

Metropolis-Hastings sampling of paths

We consider the previously unsolved problem of sampling cycle-free paths according to a given distribution from a general network. The problem is difficult because of the combinatorial number of alternatives, which prohibits a complete enumeration of all paths and hence also forbids to compute the normalizing constant of the sampling distribution. The problem is important because the ability to...

متن کامل

Adaptive Metropolis Sampling with Product Distributions

The Metropolis-Hastings (MH) algorithm is a way to sample a provided target distribution π(x). It works by repeatedly sampling a separate proposal distribution T (x, x) to generate a random walk {x(t)}. We consider a modification of the MH algorithm in which T is dynamically updated during the walk. The update at time t uses the {x(t < t)} to estimate the product distribution that has the least...

متن کامل

"mastermind by Importance Sampling and Metropolis- Hastings"

Two machine learning algorithms are introduced for playing a one player version of the logical game Mastermind. In the classic game of Mastermind there are two players: the encoder and the decoder. The encoder builds a secret code by selecting a sequence of four pegs, each chosen from six different colors. The decoder then attempts to guess the secret code in as few turns as possible. In this v...

متن کامل

Adaptive Component-wise Multiple-Try Metropolis Sampling

One of the most widely used samplers in practice is the component-wise MetropolisHastings (CMH) sampler that updates in turn the components of a vector spaces Markov chain using accept-reject moves generated from a proposal distribution. When the target distribution of a Markov chain is irregularly shaped, a ‘good’ proposal distribution for one part of the state space might be a ‘poor’ one for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the American Statistical Association

سال: 2021

ISSN: ['0162-1459', '1537-274X', '2326-6228', '1522-5445']

DOI: https://doi.org/10.1080/01621459.2021.1982723